Polynomial-Time Isomorphism of 1-L-Complete Sets
نویسندگان
چکیده
منابع مشابه
Polynomial-Time Isomorphism of 1-L-Complete Sets
Let C be any complexity class closed under log-lin reductions. We show that all sets complete for C under 1-L reductions are polynomialtime isomorphic to each other. We also generalize the result to reductions computed by finite-crossing machines. As a corollary, we show that all sets complete for C under 2-way DFA reductions are polynomial-time isomorphic to each other.
متن کاملStrong Reductions and Isomorphism of Complete Sets
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. • If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. • If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomo...
متن کاملSubgraph Isomorphism in Polynomial Time
In this paper, we propose a new approach to the problem of subgraph isomorphism detection. The new method is designed for systems which di erentiate between graphs that are a priori known, so-called model graphs, and unknown graphs, so-called input graphs. The problem to be solved is to nd a subgraph isomorphism from an input graph, which is given on-line, to any of the model graphs. The new me...
متن کاملA Polynomial Time Algorithm for Graph Isomorphism
Algorithms testing two graphs for isomorphism known as yet in computer science have exponential worst case complexity. In this paper we propose an algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.
متن کاملIsomorphism Testing via Polynomial-Time Graph Extensions
This paper deals with algorithms for detecting graph isomorphism (GI) properties. The GI literature consists of numerous research directions, from highly theoretical studies (e.g. defining the GI complexity class) to very practical applications (pattern recognition, image processing). We first present the context of our work and provide a brief overview of various algorithms developed in such d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0057